General Homomorphic Overloading
نویسندگان
چکیده
A general homomorphic overloading in a first-order type system is discussed. Type inference is applied within predefined classes each containing an arbitrary first-order subtyping hierarchy. We propose a computationally efficient type inference algorithm by converting the attendant constraint-satisfaction problem into the algebraic path problem for a constraint graph weighted with elements of a specially constructed non-commutative star semiring. The elements of the semiring are monotonic functions from integers to integers (including ±∞) with pointwise maximum and function composition as semiring operations. The computational efficiency of our method is due to Klene’s algebraic path method’s cubic complexity. Our algorithm is applicable to type inference in the presence of unknown external types and supports distributed type
منابع مشابه
A general framework for building noise-free homomorphic cryptosystems
We present a general framework for developing and analyzing homomorphic cryptosystems whose security relies on the difficulty of solving systems of nonlinear equations over Zn, n being an RSA modulus. In this framework, many homomorphic cryptosystems can be conceptualized. Based on symmetry considerations, we propose a general assumption that ensures the security of these schemes. To highlight ...
متن کاملGeneral Impossibility of Group Homomorphic Encryption in the Quantum World
Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation. Unfortunately, recent advances in quantum computation show that many of the existing schemes completely break down once quantum computers reach maturity (mainly...
متن کاملHomomorphic Encryption Schemes: Steps to Improve the Proficiency
Homomorphic encryption schemes are malleable by design. In this paper, we find different approaches to practical homomorphic encryption schemes. Partial homomorphic encryption schemes, we observe that the main bottleneck of this scheme is that it is capable of or adapted for turning easily from one to another of various tasks. To solve this problem, we propose general approach to improve the ve...
متن کاملHomomorphic Signature Schemes - A Survey
Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-dated survey about the state of the art of homomorphic signature schemes. First, the general framework where homomorphic signatures are defined is described and it is shown how ...
متن کاملSufficient Conditions for Collision-Resistant Hashing
We present several new constructions of collision-resistant hash-functions (CRHFs) from general assumptions. We start with a simple construction of CRHF from any homomorphic encryption. Then, we strengthen this result by presenting constructions of CRHF from two other primitives that are implied by homomorphic-encryption: one-round private information retrieval (PIR) protocols and homomorphic o...
متن کامل